Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field
نویسنده
چکیده
We study the solution of the discrete logarithm problem for the Jacobian of a curve of genus g defined over an extension field Fqn , by decomposed attack, considering a external elements B0 given by points of the curve whose x-coordinates are defined in Fq. In the decomposed attack, an element of the group which is written by a sum of some elements of external elements is called (potentially) decomposed and the set of the terms, that appear in the sum, is called decomposed factor. In order for the running of the decomposed attack, a test for the (potential) decomposeness and the computation of the decomposed factor are needed. Here, we show that the test to determine if an element of the Jacobian (i.e., reduced divisor) is written by an ng sum of the elements of the external elements and the computation of decomposed factor are reduced to the problem of solving some multivariable polynomial system of equations by using the Riemann-Roch theorem. In particular, in the case of a hyperelliptic curve, we construct a concrete system of equations, which satisfies these properties and consists of (n−n)g quadratic equations. Moreover, in the case of (g, n) = (1, 3), (2, 2) and (3, 2), we give examples of the concrete computation of the decomposed factors by using the computer algebra system Magma.
منابع مشابه
Classification of Elliptic/hyperelliptic Curves with Weak Coverings against GHS Attack without Isogeny Condition
The GHS attack is known as a method to map the discrete logarithm problem(DLP) in the Jacobian of a curve C0 defined over the d degree extension kd of a finite field k to the DLP in the Jacobian of a new curve C over k which is a covering curve of C0. Recently, classification and density analysis were shown for all elliptic and hyperelliptic curves C0/kd of genus 2, 3 which possess (2, . . . , ...
متن کاملClassification of Elliptic/hyperelliptic Curves with Weak Coverings against GHS Attack under an Isogeny Condition
The GHS attack is known as a method to map the discrete logarithm problem(DLP) in the Jacobian of a curve C0 defined over the d degree extension kd of a finite field k to the DLP in the Jacobian of a new curve C over k which is a covering curve of C0. Such curves C0/kd can be attacked by the GHS attack and index calculus algorithms. In this paper, we will classify all elliptic curves and hypere...
متن کاملA classification of elliptic curves with respect to the GHS attack in odd characteristic
The GHS attack is known to solve discrete logarithm problems (DLP) in the Jacobian of a curve C0 defined over the d degree extension field kd of k := Fq by mapping it to the DLP in the Jacobian of a covering curve C of C0 over k. Recently, classifications for all elliptic curves and hyperelliptic curves C0/kd of genus 2,3 which possess (2, ..., 2)-covering C/k of P were shown under an isogeny c...
متن کاملA fast graph algorithm for genus-2 hyperelliptic curve discrete logarithm problems
In 1989, Koblitz proposed using the Jacobian of a hyperelliptic curve defined over a finite field to implement discrete logarithm cryptographic protocols. The discrete logarithm problem of the Jacobian is called hyperelliptic curve discrete logarithm problem (HCDLP). For a hyperelliptic curve of genus g over the finite field Fq, the group order of the Jacobian is ( ) g O q which is larger than ...
متن کاملGenerating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
In hyperelliptic curve cryptography, finding a suitable hyperelliptic curve is an important fundamental problem. One of necessary conditions is that the order of its Jacobian is a product of a large prime number and a small number. In the paper, we give a probabilistic polynomial time algorithm to test whether the Jacobian of the given hyperelliptic curve of the form Y 2 = X+uX+vX satisfies the...
متن کامل